Settling the complexity of computing approximate two-player Nash equilibria
نویسندگان
چکیده
منابع مشابه
Multi-player Approximate Nash Equilibria
In this paper we study the complexity of finding approximate Nash equilibria in multi-player normal-form games. First, for any constant number n, we present a polynomial-time algorithm for computing a relative ( 1− 1 1+(n−1)n ) -Nash equilibrium in arbitrary nplayer games and a relative ( 1− 1 1+(n−1)n−1 ) -Nash equilibrium in symmetric n-player games. Next, we show that there is an additive ε-...
متن کاملApproximate Nash Equilibria for Multi-player Games
We consider games of complete information with r ≥ 2 players, and study approximate Nash equilibria in the additive and multiplicative sense, where the number of pure strategies of the players is n. We establish a lower bound of r−1 √ lnn−2 ln lnn−ln r ln r on the size of the support of strategy profiles which achieve an ε-approximate equilibrium, for ε < r−1 r in the additive case, and ε < r− ...
متن کاملSettling Some Open Problems on 2-Player Symmetric Nash Equilibria
Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was stated by Papadimitriou in 2007: find a non-symmetric Nash equilibrium (NE) in a symmetric game. We show that this problem is NP-complete and ...
متن کاملOn the Communication Complexity of Approximate Nash Equilibria
We study the problem of computing approximate Nash equilibria of bimatrix games, in a setting where players initially know their own payoffs but not the payoffs of the other player. In order for a solution of reasonable quality to be found, some amount of communication needs to take place between the players. We are interested in algorithms where the communication is substantially less than the...
متن کاملThe Complexity of Nash Equilibria
The Complexity of Nash Equilibria by Constantinos Daskalakis Doctor of Philosophy in Computer Science University of California, Berkeley Professor Christos H. Papadimitriou, Chair The Internet owes much of its complexity to the large number of entities that run it and use it. These entities have different and potentially conflicting interests, so their interactions are strategic in nature. Ther...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGecom Exchanges
سال: 2017
ISSN: 1551-9031
DOI: 10.1145/3055589.3055596